Shared mobility oriented open vehicle routing with order radius decision
نویسندگان
چکیده
In the era of sharing economy and mobility-as-service, last mile delivery system is undergoing revolutionary changes with emerging a lot new operation modes policies. The crowdsourced mode has become novel popular practice in industry. This brings way for facilitating efficiency on basis shared mobility. paper studies an open vehicle routing problem (OVRP) mobility based mode, which parcel orders are disseminated within circle to attract occasional vehicles (or couriers) fulfill these orders. Different from traditional OVRP, this study further considers decision above mentioned circle’s radius, should be balanced between attracting enough reducing additional cost (reward) covering vehicles’ empty trips pickup location. proposes nonlinear mixed-integer programming model problem. A column generation solution method implemented solve model. Some numerical experiments also conducted validate draw out some managerial implications practitioners. proposed methodology may potentially benefit not only but promoting modern transportation paradigm revolution ridesharing mobility-as-service.
منابع مشابه
A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملCAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES
The overall cost of companies dealing with the distribution tasks is considerably affected by the way that distributing vehicles are procured. In this paper, a more practical version of capacitated vehicle routing problem (CVRP) in which the decision of purchase or hire of vehicles is simultaneously considered is investigated. In CVRP model capacitated vehicles start from a single depot simulta...
متن کاملDecision Support System for Open Vehicle Routing With Transhipments and Stopovers
Corresponding Author: Naragain Phumchusri Department of Industrial Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand Email: [email protected] Abstract: Transshipments and stopovers are considered to be an effective method to reduce traveling distance where a transportation job can be served by two vehicles: One picks up a load and drops it at a transshipment ...
متن کاملOpen vehicle routing problem with driver nodes and time deadlines
In this paper we consider a variant of the open vehicle routing problem in which vehicles depart from the depot, visit a set of customers and end their routes at special nodes called driver nodes. A driver node can be the home of the driver or a parking lot where the vehicle will stay overnight. The resulting problem is referred to as the open vehicle routing problem with driver nodes (OVRP-d)....
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part A-policy and Practice
سال: 2021
ISSN: ['1879-2375', '0965-8564']
DOI: https://doi.org/10.1016/j.tra.2020.11.010